Computing Geometric Structures of Low Stabbing Number in the Plane∗
نویسندگان
چکیده
The stabbing number of a geometric structure in IR with respect to lines is the maximum number of times any line stabs (intersects) the structure. We present algorithms for constructing popular geometric data structures with small stabbing number and for computing lower bounds on an optimal solution. We evaluate our methods experimentally.
منابع مشابه
Stabbers of line segments in the plane
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the following problems: computing the stabbing wedges for S, finding a stabbing wedge for a set of parallel segments with equal length, and computing other stabbers for S such as a double-wedge and a zigzag. The time and space ...
متن کاملاثر تهی‌جای‌های گسترده بر خواص گرمایی نانونوارهای آرمچیری گرافن
This paper shows a theoretical study of the thermal properties of armchair grapehen nanoribbons in the presence of extended vacancies. Each graphene nanoribbons formed by superlattices with a periodic geometric structure, different size and symmetry of vacancies. The phonon dispersion, specific heat and thermal conductivity properties are described by a force-constant model and also by Landauer...
متن کاملOrthogonal segment stabbing
We study a class of geometric stabbing/covering problems for sets of line segments, rays, and lines in the plane. While we demonstrate that the problems on sets of horizontal/vertical line segments are NP-complete, we show that versions involving (parallel) rays or lines are polynomially solvable.
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملAN EFFICIENT OPTIMIZATION PROCEDURE BASED ON CUCKOO SEARCH ALGORITHM FOR PRACTICAL DESIGN OF STEEL STRUCTURES
Different kinds of meta-heuristic algorithms have been recently utilized to overcome the complex nature of optimum design of structures. In this paper, an integrated optimization procedure with the objective of minimizing the self-weight of real size structures is simply performed interfacing SAP2000 and MATLAB® softwares in the form of parallel computing. The meta-heuristic algorithm chosen he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007